package code1.dp;

/**
 * 原题链接：https://leetcode.cn/problems/longest-common-subsequence/
 */
public class P1143 {

    //最长公共子序列问题
    public int longestCommonSubsequence(String text1, String text2) {
        int n=text1.length(),m=text2.length();
        char[] str1 = text1.toCharArray();
        char[] str2 = text2.toCharArray();
        int[][] dp=new int[n+1][m+1];
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(str1[i-1]==str2[j-1]){
                    dp[i][j]=dp[i-1][j-1]+1;
                }else{
                    dp[i][j]=Math.max(dp[i-1][j],dp[i][j-1]);
                }
            }
        }
        return dp[n][m];
    }

}
